Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P
نویسنده
چکیده
We consider a two-player infinite game with zero-reachability objectives played on a 2-dimensional vector addition system with states (VASS), the states of which are divided between the two players. Brázdil, Jančar, and Kučera (2010) have shown that for k > 0, deciding the winner in a game on k-dimensional VASS is in (k − 1)EXPTIME. In this paper, we show that, for k = 2, the problem is in P, and thus improve the EXPTIME upper bound.
منابع مشابه
Alternating Vector Addition Systems with States
Alternating vector addition systems are obtained by equipping vector addition systems with states (VASS) with ‘fork’ rules, and provide a natural setting for infinite-arena games played over a VASS. Initially introduced in the study of propositional linear logic, they have more recently gathered attention in the guise of multi-dimensional energy games for quantitative verification and synthesis...
متن کاملReachability Games on Extended Vector Addition Systems with States
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding the winner in such games in undecidable in general, we identify several decidable and even tractable subcases of this problem obtained by restricting the number of counters and/or the sets of target configura-
متن کاملPlaying with Repetitions in Data Words Using Energy Games
We introduce two-player games which build words over infinite alphabets, and we study the problemof checking the existence of winning strategies. These games are played by two players, who take turns inchoosing valuations for variables ranging over an infinite data domain, thus generating multi-attributeddata words. The winner of the game is specified by formulas in the Logic of Rep...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملReachability Games with Counters: Decidability and Algorithms
In this thesis, we consider the problem of determining the winner in various models of reachability games played on counter systems. A game on a graph is played by two players, who own states. During a play, the players create a run on the system by moving a token between states along transitions, the choice of the transition being made by the owner of the state where the token is. When the gam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 123 شماره
صفحات -
تاریخ انتشار 2010